Solving the Binary Linear Programming Model in Polynomial Time
نویسندگان
چکیده
منابع مشابه
Solving fully fuzzy linear programming
In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear programming (abbreviated to FFLP) problems. Also, we employ linear programming (LP) with equality constraints to find a nonegative fuzzy number vector x which satisfies Ax =b, where A is a fuzzy number matrix. Then we investigate the existence of a positive solution of fully fuzzy linear system (FFLS).
متن کاملA Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملSolving multivariate polynomial systems using hyperplane arithmetic and linear programming
Solving polynomial systems of equations is an important problem in many fields such as computer-aided design and manufacturing [1] and robotics [2]. In recent years, subdivision-based solvers, which typically make use of the properties of the Bézier / B-spline representation, have proven successful in solving such systems of polynomial constraints [3, 4, 5]. A major drawback in using subdivisio...
متن کاملsolving fully fuzzy linear programming
in this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear programming (abbreviated to fflp) problems. also, we employ linear programming (lp) with equality constraints to find a nonegative fuzzy number vector x which satisfies ax =b, where a is a fuzzy number matrix. then we investigate the existence of a positive solution of fully fuzzy linear system (ffls).
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2016
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2016.61001